compress/flate.compressor.index (field)

29 uses

	compress/flate (current package)
		deflate.go#L93: 	index         int
		deflate.go#L127: 	if d.index >= 2*windowSize-(minMatchLength+maxMatchLength) {
		deflate.go#L130: 		d.index -= windowSize
		deflate.go#L188: 	if d.index != 0 || d.windowEnd != 0 {
		deflate.go#L228: 	d.index = n
		deflate.go#L378: 	d.index = 0
		deflate.go#L384: 	if d.windowEnd-d.index < minMatchLength+maxMatchLength && !d.sync {
		deflate.go#L392: 		if d.index > d.windowEnd {
		deflate.go#L395: 		lookahead := d.windowEnd - d.index
		deflate.go#L400: 			if d.index > d.windowEnd {
		deflate.go#L407: 					d.tokens = append(d.tokens, literalToken(uint32(d.window[d.index-1])))
		deflate.go#L411: 					if d.err = d.writeBlock(d.tokens, d.index); d.err != nil {
		deflate.go#L419: 		if d.index < d.maxInsertIndex {
		deflate.go#L421: 			hash := hash4(d.window[d.index : d.index+minMatchLength])
		deflate.go#L424: 			d.hashPrev[d.index&windowMask] = uint32(d.chainHead)
		deflate.go#L425: 			*hh = uint32(d.index + d.hashOffset)
		deflate.go#L431: 		minIndex := d.index - windowSize
		deflate.go#L439: 			if newLength, newOffset, ok := d.findMatch(d.index, d.chainHead-d.hashOffset, minMatchLength-1, lookahead); ok {
		deflate.go#L460: 					newIndex = d.index + d.length
		deflate.go#L462: 					newIndex = d.index + prevLength - 1
		deflate.go#L464: 				index := d.index
		deflate.go#L476: 				d.index = index
		deflate.go#L485: 				d.index += d.length
		deflate.go#L489: 				if d.err = d.writeBlock(d.tokens, d.index); d.err != nil {
		deflate.go#L496: 				i := d.index - 1
		deflate.go#L498: 					i = d.index
		deflate.go#L508: 			d.index++
		deflate.go#L620: 		d.index, d.windowEnd = 0, 0